A simple extension of a von Neumann regular ring
نویسندگان
چکیده
منابع مشابه
Von Neumann Regular Cellular Automata
For any group G and any set A, a cellular automaton (CA) is a transformation of the configuration space A G defined via a finite memory set and a local function. Let CA(G; A) be the monoid of all CA over A G. In this paper, we investigate a generalisation of the inverse of a CA from the semigroup-theoretic perspective. An element τ ∈ CA(G; A) is von Neumann regular (or simply regular) if there ...
متن کاملCalculating Different Topological Indices of Von Neumann Regular Graph of Z_(p^α )
By the Von Neumann regular graph of R, we mean the graph that its vertices are all elements of R such that there is an edge between vertices x,y if and only if x+y is a von Neumann regular element of R, denoted by G_Vnr (R). For a commutative ring R with unity, x in R is called Von Neumann regular if there exists x in R such that a=a2 x. We denote the set of Von Neumann regular elements by V nr...
متن کاملCombining Local and Von Neumann Regular Rings
All rings R considered are commutative and have an identity element. Contessa called R a VNL-ring if a or 1 a has a Von Neumann inverse whenever a 2 R. Sample results: Every prime ideal of a VNL-ring is contained in a unique maximal ideal. Local and Von Neumann regular rings are VNL and if the product of two rings is VNL, then both are Von Neumann regular, or one is Von Neumann regular and the ...
متن کاملRelative Regular Modules. Applications to von Neumann Regular Rings
We use the concept of a regular object with respect to another object in an arbitrary category, defined in [3], in order to obtain the transfer of regularity in the sense of Zelmanowitz between the categories R−mod and S−mod, when S is an excellent extension of the ring R. Consequently, we obtain a result of [5]: if S is an excellent extension of the ring R, then S is von Neumann regular ring i...
متن کاملProof Pearl: Proving a Simple Von Neumann Machine Turing Complete
In this paper we sketch an ACL2-checked proof that a simple but unbounded Von Neumann machine model is Turing Complete, i.e., can do anything a Turing machine can do. The project formally revisits the roots of computer science. It requires re-familiarizing oneself with the definitive model of computation from the 1930s, dealing with a simple “modern” machine model, thinking carefully about the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyoto Journal of Mathematics
سال: 1985
ISSN: 2156-2261
DOI: 10.1215/kjm/1250521015